ASIPATH: A Simple Path Mining Algorithm
نویسندگان
چکیده
A SImple yet very efficient PATH mining algorithm (ASIPATH) is introduced in this paper to analyze the click stream data. As in the case of the preceding sequence mining algorithm (webSPADE), ASIPATH requires only one full scan of the data and several partial scans. In parallel algorithm design, it is very common to parallelize a serial algorithm, but ASIPATH is designed for multi-CPU and sharedmemory environment in the first place. In contrast with many existing path mining algorithms, it is not based on a tree-like data structure and search method. By using very efficient join operations, the parallelization of the algorithm is simplified considerably.
منابع مشابه
Robot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملSeveral Remarks on Mining Frequent Trajectories in Graphs
We apply techniques that originate in the analysis of market basket data sets to the study of frequent trajectories in graphs. Trajectories are defined as simple paths through a directed graph, and we put forth some definitions and observations about the calculation of supports of paths in this context. A simple algorithm for calculating path supports is introduced and analyzed, but we explore ...
متن کاملNumerical solution of higher index DAEs using their IAE's structure: Trajectory-prescribed path control problem and simple pendulum
In this paper, we solve higher index differential algebraic equations (DAEs) by transforming them into integral algebraic equations (IAEs). We apply collocation methods on continuous piece-wise polynomials space to solve the obtained higher index IAEs. The efficiency of the given method is improved by using a recursive formula for computing the integral part. Finally, we apply the obtained algo...
متن کاملFrom Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two representations, namely, a memory-based prefixpath tree and a disk-based prefix-path tree. The disk-based prefix-path tree is simple in its data structure yet rich in information contained, and is small in size. The me...
متن کاملAn Effective System for Mining Web Log
The WWW provides a simple yet effective media for users to search, browse, and retrieve information in the Web. Web log mining is a promising tool to study user behaviors, which could further benefit web-site designers with better organization and services. Although there are many existing systems that can be used to analyze the traversal path of web-site visitors, their performance is still fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004